package com.cwj.algorithm.graph;

/**
 * 加权有向边
 * @author chenwujie
 * @date 2020-12-25 15:39
 */
public class DirectedEdge {
    private int from;
    private int to;
    private int weight;

    public DirectedEdge(int from, int to, int weight){
        this.from = from;
        this.to = to;
        this.weight = weight;
    }

    public int getWeight() {
        return weight;
    }

    public int getFrom() {
        return from;
    }

    public int getTo() {
        return to;
    }
}
